On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes

نویسندگان

  • Hannes Bartz
  • Vladimir Sidorenko
چکیده

Punctured Reed-Solomon (RS) and Gabidulin (G) codes over the field Fqm with locators from the subfield Fq can be represented as interleaving of m correspondent codes over the subfield Fq or can be considered as virtual interleaving of m correspondent codes over the field Fqm . Using a probabilistic unique syndrome decoder, m-interleaved or virtually interleaved codes can be decoded up to the same radius m m+1(d − 1), where d is the code distance in Hamming metric for RS codes and in rank metric for G codes. We show that the correspondent decoders over the subfield Fq and the field Fqm are equivalent and conclude that in practice one should use a decoder over the subfield since it has less complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION

Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...

متن کامل

Decoding of block and convolutional codes in rank metric

R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...

متن کامل

Reed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms

OF THE DISSERTATION Reed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms

متن کامل

On Transform–domain Decoding of Gabidulin Codes

Gabidulin codes are the rank metric analogues of Reed–Solomon codes and found many applications including network coding. Interleaving or the direct sum of Gabidulin codes allows both decreasing the redundancy and increasing the error correcting capability for network coding. In this paper, for Gabidulin codes we propose a transform–domain algorithm correcting both errors and erasures. We show ...

متن کامل

Gabidulin Codes that are Generalized Reed Solomon Codes

In this paper, we describe permutations that allow to move from a Gabidulin code to a GENERALIZED REED SOLOMON code. Mathematics Subject Classification: 11T71

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2017